Partitions of planar point sets into polygons
نویسندگان
چکیده
In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this problem is equivalent to finding a specified 2-factor in the visibility graph of the point set. The characterization for the case where all cycles have length 3 also translates to finding a K3-factor of the visibility graph of the point set. We show that the generalized problem of finding a Kk-factor of the visibility graph of a given point set for k ≥ 5 is NP-hard.
منابع مشابه
On Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملOn pseudo-convex decompositions, partitions, and coverings
We introduce pseudo-convex decompositions, partitions, and coverings for planar point sets. They are natural extensions of their convex counterparts and use both convex polygons and pseudo-triangles. We discuss some of their basic combinatorial properties and establish upper and lower bounds on their complexity.
متن کاملOn the number of disjoint convex quadrilaterals for a planar point set
For a given planar point set P , consider a partition of P into disjoint convex polygons. In this paper, we estimate the maximum number of convex quadrilaterals in all partitions. 2001 Elsevier Science B.V. All rights reserved.
متن کاملValidation of Planar Partitions Using Constrained Triangulations
Planar partitions—full tessellations of the plane into non-overlapping polygons—are frequently used in GIS to model concepts such as land cover, cadastral parcels or administrative boundaries. Since in practice planar partitions are often stored as a set of individual objects (polygons) to which attributes are attached (e.g. stored with a shapefile), and since different errors/mistakes can be i...
متن کامل